Minimizing Average Spraying Cost for Routing in Delay Tolerant Networks
نویسندگان
چکیده
In this paper, we study cost efficient multi-copy spraying algorithm for routing in Delay Tolerant Networks (DTN) in which source-to-destination path does not exist most of the time. We present a novel idea and the corresponding algorithm for achieving the average minimum cost of packet transmission while maintaining the desired delivery rate by the given deadline. The number of message copies in the network depends on the urgency of meeting the delivery deadline for that message. We find the efficient copying strategy analytically and validate the analytical results with simulations. The results demonstrate that our time dependent spraying algorithm achieves lower cost of message copying than the original spraying algorithm while maintaining the desired delivery rate by the deadline.
منابع مشابه
Energy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks
Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...
متن کاملپروتکل مسیریابی خودتطبیقی با محدوده تأخیر برای شبکه های موردی بین خودرویی
Abstract Vehicular Ad Hoc Network (VANET) is a particular type of mobile ad hoc network in which vehicles communicate between themselves using wireless antenna. Due to unique characteristics of VANETs (e.g. high mobility of nodes and dynamic topology), routing is one of the challenging tasks in such networks. Consequently, delay tolerant networks which consider the disconnect nature of...
متن کاملA Utility-based Multi-copy Forwarding Algorithm in Delay Tolerant Networks
In delay tolerant networks (DTNs) with uncertainty in node mobility, message forwarding usually employs a multi-copy, opportunistic forwarding scheme to improve delivery probability. Minimizing the delivery latency (delay) and minimizing the number of forwardings (message copies) have been two conflicting goals. On the other hand, utility-based routing has been proposed in multi-hop wireless ne...
متن کاملOptimal and achievable cost/delay tradeoffs in delay-tolerant networks
Tradeoffs between the packet delivery delay and other metrics are a recurring theme in Delay Tolerant Networks (DTNs). In this work we study these tradeoffs, first in a general, and then in a more specific, mobile wireless setting. We first develop a general setting in which the packet delivery delay can be traded off with a packet transportation cost that is comprised of a transmission cost an...
متن کاملAnycast Routing in Delay Tolerant Networks
Anycast routing is very useful for many applications such as resource discovery in Delay Tolerant Networks (DTNs). In this paper, we first analyze the anycast semantics for DTN based on a new DTN model. Then we present a novel metric named EMDDA (Expected Multi-Destination Delay for Anycast) and a corresponding routing algorithm for anycast routing in DTNs. Extensive simulation results show tha...
متن کامل